Canonizing structural Ramsey theorems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate euclidean ramsey theorems

According to a classical result of Szemerédi, every dense subset of 1, 2, . . . , N contains an arbitrary long arithmetic progression, if N is large enough. Its analogue in higher dimensions due to Fürstenberg and Katznelson says that every dense subset of {1, 2, . . . , N}d contains an arbitrary large grid, if N is large enough. Here we generalize these results for separated point sets on the ...

متن کامل

On Ramsey-type theorems

In [21], Frank Plumpton Ramsey proved what has turned out to be a remarkable and important theorem which is now known as Ramsey's theorem. This result is a generalization of the pigeonhole principle and can now be seen as part of a family of theorems of the same flavour. These Ramsey-type theorems all have the common feature that they assert, in some precise combinatorial way, that if we deal w...

متن کامل

Euclidean Ramsey Theorems

Eucl dean Ramsey Theorems . I P . ERDöS Mathemat cs Inst tute, Hungar an Academy of Sc ence, Budapest 9, Hungary R. L. GRAHAM Bell Telephone Laborator es, Murray H ll, New Jersey 07971 P . MONTGOMERY Systems Development Corporat on, Huntsv lle Alabama B. L . ROTHSCHILD' Un vers ty of Cal forn a, Los Angeles, Cal forn a 90024 J. SPENCER' Massachusetts Inst tute of Technology, Cambr dge, Massachu...

متن کامل

Induced Ramsey-type theorems

We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and improve the earlier results of Rödl, ErdősHajnal, Prömel-Rödl, Nikiforov, Chung-Graham, and Luczak-Rödl. The proofs are based on a simple lemma (generalizing one by Graham, Rödl, and Ruciński) that can be used as a replacement for Szemerédi’s regularity lemm...

متن کامل

Ramsey-type theorems

In this paper we will consider Ramsey-type problems for finite graphs, r-partitions and hypergraphs. All these problems ask for the existence of large homogeneous (monochromatic) configurations of a certain kind under the condition that the size of the underlying set is large. As it is quite common in Ramsey theory, most of our results are not sharp and almost all of them lead to new problems w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2019

ISSN: 0012-365X

DOI: 10.1016/j.disc.2018.11.016